point-to-point routing method
- point-to-point routing method
метод двухпунктовой маршрутизации пакетов
Англо-русский словарь промышленной и научной лексики.
2014.
Смотреть что такое "point-to-point routing method" в других словарях:
Point-to-point tunneling protocol — The Point to Point Tunneling Protocol (PPTP) is a method for implementing virtual private networks. Layer 2 Tunneling Protocol (L2TP) [ [http://www.ietf.org/rfc/rfc2661.txt Layer Two Tunneling Protocol L2TP ] ,RFC 2661, W. Townsley et al. ,August … Wikipedia
Classless Inter-Domain Routing — CIDR redirects here. For other uses, see CIDR (disambiguation). Classless Inter Domain Routing (CIDR) is a method for allocating IP addresses and routing Internet Protocol packets. The Internet Engineering Task Force introduced CIDR in 1993 to… … Wikipedia
Channel access method — In telecommunications and computer networks, a channel access method or multiple access method allows several terminals connected to the same multi point transmission medium to transmit over it and to share its capacity. Examples of shared… … Wikipedia
Small world routing — In network theory, small world routing refers to routing methods for small world networks. Networks of this type are peculiar in that relatively short paths exist between any two nodes. Determining these paths, however, can be a difficult problem … Wikipedia
Distance-vector routing protocol — In computer communication theory relating to packet switched networks, a distance vector routing protocol is one of the two major classes of routing protocols, the other major class being the link state protocol. Distance vector routing protocols … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Maze runner — For the novel by James Dashner, see The Maze Runner. Maze runner is a connection routing method that represents the entire routing space as a grid. Parts of this grid are blocked by components, specialised areas, or already present wiring. The… … Wikipedia
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia